Tokunaga and Horton self-similarity for level set trees of Markov chains
نویسندگان
چکیده
منابع مشابه
Tokunaga and Horton self-similarity for level set trees of Markov chains
The Horton and Tokunaga branching laws provide a convenient framework for studying self-similarity in random trees. The Horton self-similarity is a weaker property that addresses the principal branching in a tree; it is a counterpart of the power-law size distribution for elements of a branching system. The stronger Tokunaga self-similarity addresses so-called side branching. The Horton and Tok...
متن کاملHorton Self-similarity of Kingman’s Coalescent Tree
The paper establishes Horton self-similarity for a tree representation of Kingman’s coalescent process. The proof is based on a Smoluchowski-type system of ordinary differential equations that describes evolution of the number of branches of a given HortonStrahler order in a tree that represents Kingman’s N -coalescent, in a hydrodynamic limit. We also demonstrate a close connection between the...
متن کاملHorton Law in Self-Similar Trees
Abstract. Self-similarity of random trees is related to the operation of pruning. Pruning R cuts the leaves and their parental edges and removes the resulting chains of degree-two nodes from a finite tree. A Horton-Strahler order of a vertex v and its parental edge is defined as the minimal number of prunings necessary to eliminate the subtree rooted at v. A branch is a group of neighboring ver...
متن کاملTriplet Partially Markov Chains and Trees
Hidden Markov models (HMM), like chains or trees considered in this paper, are widely used in different situations. Such models, in which the hidden process X is a Markov one, allow one estimating the latter from an observed process Y , which can be seen as a noisy version of X . This is possible once the distribution of X conditional on Y is a Markov distribution. These models have been recent...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos, Solitons & Fractals
سال: 2012
ISSN: 0960-0779
DOI: 10.1016/j.chaos.2011.11.006